Critical Points of Three–dimensional Bootstrap Percolation–like Cellular Automata
نویسنده
چکیده
This paper deals with the critical point of three-dimensional bootstrap percolation-like cellular automata. Some general sufficient or necessary conditions for pc = 0 are obtained. In the case of pc > 0, some explicit upper and lower bounds are provided in terms of the critical value of oriented site percolation.
منابع مشابه
Spiral Model: a cellular automaton with a discontinuous glass transition
We introduce a new class of two-dimensional cellular automata with a bootstrap percolation-like dynamics. Each site can be either empty or occupied by a single particle and the dynamics follows a deterministic updating rule at discrete times which allows only emptying sites. We prove that the threshold density ρc for convergence to a completely empty configuration is non trivial, 0 < ρc < 1, co...
متن کاملFinite size scaling in three-dimensional bootstrap percolation
We consider the problem of bootstrap percolation on a three dimensional lattice and we study its finite size scaling behavior. Bootstrap percolation is an example of Cellular Automata defined on the d-dimensional lattice {1, 2, ..., L} in which each site can be empty or occupied by a single particle; in the starting configuration each site is occupied with probability p, occupied sites remain o...
متن کاملScaling Limit and Critical Exponents for Two-Dimensional Bootstrap Percolation
Consider a cellular automaton with state space {0, 1}Z2 where the initial configuration ω0 is chosen according to a Bernoulli product measure, 1’s are stable, and 0’s become 1’s if they are surrounded by at least three neighboring 1’s. In this paper we show that the configuration ωn at time n converges exponentially fast to a final configuration ω̄, and that the limiting measure corresponding to...
متن کاملMaximal Percolation Time in Hypercubes Under 2-Bootstrap Percolation
Bootstrap percolation is one of the simplest cellular automata. In r-bootstrap percolation on a graph G, an infection spreads according to the following deterministic rule: infected vertices of G remain infected forever and in consecutive rounds healthy vertices with at least r already infected neighbours become infected. Percolation occurs if eventually every vertex is infected. In this paper ...
متن کاملBootstrap percolation, and other automata
Many fundamental and important questions from statistical physics lead to beautiful problems in extremal and probabilistic combinatorics. One particular example of this phenomenon is the study of bootstrap percolation, which is motivated by a variety of ‘real-world’ cellular automata, such as the Glauber dynamics of the Ising model of ferromagnetism, and kinetically constrained spin models of t...
متن کامل